Colorful graph associahedra
نویسندگان
چکیده
Given a graph G, the associahedron is simple convex polytope whose face poset based on connected subgraphs of G. With additional assignment color palette, we define colorful associahedron, show it to be collection abstract polytopes, and explore its properties.
منابع مشابه
Graph Properties of Graph Associahedra
A graph associahedron is a simple polytope whose face lattice encodes the nested structure of the connected subgraphs of a given graph. In this paper, we study certain graph properties of the 1-skeleta of graph associahedra, such as their diameter and their Hamiltonicity. Our results extend known results for the classical associahedra (path associahedra) and permutahedra (complete graph associa...
متن کاملOf Graph - Associahedra
Given any finite graph G, we offer a simple realization of the graph-associahedron PG using integer coordinates.
متن کاملCoxeter Complexes and Graph-associahedra
Given a graph Γ, we construct a simple, convex polytope, dubbed graphassociahedra, whose face poset is based on the connected subgraphs of Γ. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that for any simplicial Coxeter system, the minimal blow-ups of its associated Coxeter complex has a tiling by graph-associahedra. The ...
متن کاملA realization of graph associahedra
Given any finite graph G, we offer a simple realization of the graph-associahedron PG using integer coordinates.
متن کاملInequalities between Gamma-Polynomials of Graph-Associahedra
We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with n vertices that induces inequalities between the γ-polynomials of their associated graph-associahedra. The partial order is given by relating trees that can be obtained from one another by operations called tree shifts. We also show that tree shifts lower the γ-polynomials of graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Combinatorics
سال: 2023
ISSN: ['2150-959X', '2156-3527']
DOI: https://doi.org/10.4310/joc.2023.v14.n3.a4